Level Set Characterization of M-convex Functions
نویسنده
چکیده
This note shows that level sets of a function characterize an M-convex function introduced by Murota.
منابع مشابه
On Fejér Type Inequalities for (η1,η2)-Convex Functions
In this paper we find a characterization type result for (η1,η2)-convex functions. The Fejér integral inequality related to (η1,η2)-convex functions is obtained as a generalization of Fejér inequality related to the preinvex and η-convex functions. Also some Fejér trapezoid and midpoint type inequalities are given in the case that the absolute value of the derivative of considered function is (...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کامل(m1,m2)-AG-Convex Functions and Some New Inequalities
In this manuscript, we introduce concepts of (m1,m2)-logarithmically convex (AG-convex) functions and establish some Hermite-Hadamard type inequalities of these classes of functions.
متن کاملA New Characterization of M^-convex Set Functions by Substitutability
The concepts of M-convex functions and M^-convex functions play central roles in the theory of discrete convex analysis which has been applied to mathematical economics. On the other hand, substitutability, which is a key property guaranteeing the existence of a stable matching in generalized stable marriage models, is known as a nice property in mathematical economics. In this paper, we introd...
متن کاملThe convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...
متن کامل